leaf node
英 [liːf nəʊd]
美 [liːf noʊd]
网络 叶子结点; 叶子节点; 叶节点; 叶结点; 树叶节点
英英释义
noun
- (botany) the small swelling that is the part of a plant stem from which one or more leaves emerge
双语例句
- Staining results showed that POS mRNA was detected in vegetative organs, including root, leaf, shoot apex, upper node and tiller.
GUS染色结果显示，POS基因在根、叶、茎尖、节位和分蘖芽都有表达。 - In the index tree, leaf node is storing the XML data.
索引树中的叶子节点存放着XML节点的数据。 - This method returns the children of the given tree node, or it returns null if the leaf tree node is encountered.
该方法返回给定树节点的子节点，或者如果遇到叶子节点，它返回null。 - In Business Glossary, a business term represents a "leaf" node, which cannot contain any further child nodes.
在BusinessGlossary内，一个业务术语代表的是一个“叶子”节点，该节点不能包含任何进一步的子节点。 - The treatment of trampling profoundly affected the leaf length, width, node location of a leaf and above ground biomass.
踩踏则深刻影响了叶片的长度、宽度、a、b叶着生节点位置、地上部分生物量。 - Photosynthetic contribution of non-leaf organs above flag leaf node to grain yield accounted for 70%~ 80%, which increased with water supply decreasing or plant density increasing. 2.
在旗叶节以上器官对粒重的总贡献率中，非叶器官的贡献率所占比例达70～80%，随灌水减少、密度增大而增加。 - For large files ( including those that are fragmented), an inode can reference an index node, each of which can reference a leaf node ( referencing multiple extents).
对于大文件（包括片段文件），一个inode能够引用一个索引节点，而每个索引节点能够引用一个叶节点（引用多个区段）。 - For each leaf node of each decision tree, the shift information of the local features to the object center ( offest) and the class information of these features, together with the class information of this leaf node are stored.
在决策树的每个叶子节点中，记录到达该节点的局部特征相对于目标中心的偏移量及其相应的类别信息、以及该叶子节点的类别信息。 - It proposes a hybrid approach for regression analysis& BRT ( Bayesian regression tree), which builds tree model by the divide-and-conquer method and uses NBR ( naive Bayesian network for regression) to replace leaf node.
结合朴素贝叶斯和决策树提出一种用于回归分析的混合学习方法&BRT（BayesianRegressionTree）。该方法基于分而治之原则构造决策树，以朴素贝叶斯取代叶节点。 - The central idea of improved B~+ tree algorithm is to allow the number of keys in non-leaf node is N times of leaf node.
改进B~+树算法的核心思想是让非叶子结点可含有的最多关键字个数是叶子结点的N倍。